A survey on graph partitioning approach to spectral clustering
نویسندگان
چکیده
منابع مشابه
A MinMaxCut Spectral Method for Data Clustering and Graph Partitioning
The goal of data clustering can be formally stated as a min-max clustering principle: data points are grouped into clusters such that (a) between-cluster similarities are minimized while (b) within-cluster similarities are maximized. Existing methods typically focus on one of the above requirements. Here we propose a new method that emphasizes both requirements simultaneously. The MinMaxCut met...
متن کاملA Spectral Clustering Approach To Finding Communities in Graph
Clustering nodes in a graph is a useful general technique in data mining of large network data sets. In this context, Newman and Girvan [9] recently proposed an objective function for graph clustering called the Q function which allows automatic selection of the number of clusters. Empirically, higher values of the Q function have been shown to correlate well with good graph clusterings. In thi...
متن کاملGraph Partitioning and Graph Clustering
We present an overview over our graph partitioners KaFFPa (Karlsruhe Fast Flow Partitioner) and KaFFPaE (KaFFPa Evolutionary). KaFFPa is a multilevel graph partitioning algorithm which on the one hand uses novel local improvement algorithms based on max-flow and min-cut computations and more localized FM searches and on the other hand uses more sophisticated global search strategies transferred...
متن کاملClustering Object-Oriented Software Systems using Spectral Graph Partitioning
In this paper we propose a novel method for identifying dense communities of classes (clusters) within an object-oriented software system. These clusters suggest the decomposition of the software system into smaller subsystems. Also, such clusters can imply relevance of functionality and thus be used as reusable components. To accomplish the identification we employ a technique from algebraic g...
متن کاملClustering Blogs Using Document Context Similarity and Spectral Graph Partitioning
Semantic-based document clustering has been a challenging problem over the past few years and its execution depends on modeling the underlying content and its similarity metrics. Existing metrics evaluate pair wise text similarity based on text content, which is referred as content similarity. The performances of these measures are based on co-occurrences, and ignore the semantics among words. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2015
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/31/1/4108